Caterpillars and Polymorphisms
نویسنده
چکیده
possible to estimate preindustrial CC14 levels accurately from measurements in slowly renewed deep waters (1). In contrast, loss of CH3CC13 would be considerable even in cold waters over a period of only 40 years (that is, since CH3CC13 was introduced into the environment), and it has an input function that is not dramatically different in nature from those of F-li and F-12 (1). We thus reiterate that no great advantage will be gained from its use as an additional tracer. We recommend that GC14 be measured together with F-I1, F-12, and F-113 during future oceanographic sampling expeditions. We also encourage our colleagues to perform hydrolysis rate measurements for these compounds and the chlorofluorocarbons in seawater: data concerning the latter class of compounds, and measurements in seawater in general, are notably lacking in the literature. D. W. R. WALLACE Oceanographic Sciences Division, Department ofApplied Science, Brookhaven National Laboratory, Upton, NY 11973 M. KRYSELL Department ofAnalytical and Marine Chemistry, Chalmers University of Technology, and University of Goteborg, S412 96, Gdteborg, Sweden
منابع مشابه
Snakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملOn the harmonic index and harmonic polynomial of Caterpillars with diameter four
The harmonic index H(G) , of a graph G is defined as the sum of weights 2/(deg(u)+deg(v)) of all edges in E(G), where deg (u) denotes the degree of a vertex u in V(G). In this paper we define the harmonic polynomial of G. We present explicit formula for the values of harmonic polynomial for several families of specific graphs and we find the lower and upper bound for harmonic index in Caterpill...
متن کاملEmbedding Ladders and Caterpillars into
We present embeddings of generalized ladders as subgraphs into the hypercube. By embedding caterpillars into ladders, we obtain embeddings of caterpillars into the hypercube. In this way we obtain almost all known results concerning the em-beddings of caterpillars into the hypercube. In addition we construct embeddings for some new types of caterpillars.
متن کاملEmbedding ladders and caterpillars into the hypercube
We present embeddings of generalized ladders as subgraphs into the hypercube. By embedding caterpillars into ladders, we obtain embeddings of caterpillars into the hypercube. In this way we obtain almost all known results concerning the embeddings of caterpillars into the hypercube. In addition we construct embeddings for some new types of caterpillars.
متن کامل